-
1 halting problem
проблема остановки выполнения программы
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > halting problem
-
2 halting problem
English-Russian dictionary of Information technology > halting problem
-
3 halting problem
strength problem — задача о прочности; проблема прочности
The English-Russian dictionary general scientific > halting problem
-
4 halting problem
-
5 halting problem
1) Математика: задача об остановке, задача остановки2) Вычислительная техника: проблема остановки3) Бытовая техника: проблема останова -
6 halting problem
-
7 halting problem
The New English-Russian Dictionary of Radio-electronics > halting problem
-
8 halting problem
Англо-русский словарь компьютерных и интернет терминов > halting problem
-
9 halting problem
-
10 halting problem
English-Russian dictionary on household appliances > halting problem
-
11 halting problem
English-Russian dictionary of terms that are used in computer games > halting problem
-
12 halting problem
проблема остановаEnglish-Russian dictionary of technical terms > halting problem
-
13 halting problem
в теории вычислений - проблема определения, остановится ли (завершится ли) данная программа при вычислении данного набора входных данных. Эта проблема относится к числу алгоритмически неразрешимых задачсм. тж. algorithmic undecidabilityАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > halting problem
-
14 halting problem
-
15 halting problem
-
16 entscheidungsproblem (halting problem)
проблема остановки
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > entscheidungsproblem (halting problem)
-
17 halting
1. n остановка2. n тех. перебой; сбой; останов; неровный ход3. a спотыкающийся, хромающий4. a запинающийсяhalting speech — неплавная речь, речь с заминками и паузами
Синонимический ряд:1. awkward (adj.) awkward; bumbling; gauche; ham-handed; heavy-handed; lumbering; maladroit; unhandy; unhappy; wooden2. vacillating (adj.) clumsy; double-minded; faltering; hesitant; hesitating; indecisive; inept; irresolute; pendulous; shilly-shally; shilly-shallying; slow; stammering broken; tentative; timid; uncertain; undecisive; unresolved; vacillant; vacillating; vacillatory; wavering; weak-kneed; whiffling; wiggle-waggle; wobbly3. hindering (noun) blocking; hindering; hindrance; impeding; obstruction; opposition; resistance4. closing (verb) closing; completing; concluding; consummating; determining; doing; ending; finishing; terminating; winding up; wrapping up5. halting (verb) break up; halting; hitching; hobbling; limping6. hesitating (verb) dithering; faltering; hesitating; pausing; shilly-shallying; staggering; vacillating; wavering; whiffling7. stopping (verb) arresting; bringing up; ceasing; checking; desisting; discontinuing; drawing up; fetching up; giving over; hauling up; interrupting; knocking off; leave off; leaving off; pulling up; quitting; stalling; staying; stopping; surceasing -
18 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
19 problem
1) проблема
2) задача
3) неисправность
– accounting problem
– advertising problem
– applied problem
– assignment problem
– attack problem
– bargaining problem
– bottleneck problem
– boundary problem
– brachistochrone problem
– caterer problem
– Cauchy problem
– check problem
– continuum problem
– control problem
– decidability problem
– decision problem
– defence problem
– diet problem
– Dirichlet's problem
– eigenvalue problem
– encounter problem
– extremum problem
– formulate problem
– formulation of problem
– four-color problem
– halting problem
– initial-value problem
– inverse problem
– many-body problem
– marriage problem
– matching problem
– moving-boundary problem
– non-stationary problem
– occupancy problem
– Plateau's problem
– primal problem
– privacy problem
– problem book
– problem calculus
– problem put by
– problem variable
– queueing problem
– refinement of problem
– set a problem
– solvable problem
– state problem
– statement of problem
– the two noncharacteristic problem
– three-point problem
– traffic problem
– transport problem
– two-body problem
– two-means problem
– warehousing problem
– word problem
– worked problem
boundary value problem — задача граничная, краевая задача
gasoline blending problem — <econ.> задача о смеси бензинов
-
20 problem
1) проблема; задача2) проблемный3) вчт прикладной ( о программе или программисте)•- AI-complete problem
- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue problem
- eigenvalue assignment problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P-problem
- polynomial time problem
- Post problem
- Post correspondence problem
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problem
- 1
- 2
См. также в других словарях:
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
halting problem — The fundamental decision problem in the theory of computation. It is the problem of finding whether there is an effective procedure for telling whether a Turing machine computation ever terminates, for an arbitrary input. The negative solution is … Philosophy dictionary
halting problem — noun The problem of deciding in finite time whether any program will finish running in finite time, when given a certain finite input … Wiktionary
Halting problem — … Википедия
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… … Wikipedia
Mathematical problem — A mathematical problem is a problem that is amenable to being represented, analyzed, and possibly solved, with the methods of mathematics. This can be a real world problem, such as computing the orbits of the planets in the solar system, or a… … Wikipedia
Chaitin's constant — In the computer science subfield of algorithmic information theory, a Chaitin constant or halting probability is a real number that informally represents the probability that a randomly constructed program will halt. These numbers are formed from … Wikipedia